TSTP Solution File: SET724^4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET724^4 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:12:59 EDT 2024
% Result : Theorem 0.14s 0.32s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SET724^4 : TPTP v8.2.0. Released v3.6.0.
% 0.08/0.10 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.09/0.30 % Computer : n027.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon May 20 13:24:37 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.30 This is a TH0_THM_EQU_NAR problem
% 0.09/0.30 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.31 % (26233)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.14/0.31 % (26228)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.14/0.31 % (26229)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.14/0.31 % (26235)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.31 % (26234)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.32 % (26232)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.32 % (26230)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.14/0.32 % (26231)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.32 % (26232)Instruction limit reached!
% 0.14/0.32 % (26232)------------------------------
% 0.14/0.32 % (26232)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.32 % (26232)Termination reason: Unknown
% 0.14/0.32 % (26232)Termination phase: shuffling
% 0.14/0.32
% 0.14/0.32 % (26232)Memory used [KB]: 895
% 0.14/0.32 % (26232)Time elapsed: 0.002 s
% 0.14/0.32 % (26232)Instructions burned: 2 (million)
% 0.14/0.32 % (26232)------------------------------
% 0.14/0.32 % (26232)------------------------------
% 0.14/0.32 % (26235)Instruction limit reached!
% 0.14/0.32 % (26235)------------------------------
% 0.14/0.32 % (26235)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.32 % (26235)Termination reason: Unknown
% 0.14/0.32 % (26235)Termination phase: Saturation
% 0.14/0.32
% 0.14/0.32 % (26235)Memory used [KB]: 1023
% 0.14/0.32 % (26235)Time elapsed: 0.003 s
% 0.14/0.32 % (26235)Instructions burned: 3 (million)
% 0.14/0.32 % (26235)------------------------------
% 0.14/0.32 % (26235)------------------------------
% 0.14/0.32 % (26229)Instruction limit reached!
% 0.14/0.32 % (26229)------------------------------
% 0.14/0.32 % (26229)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.32 % (26229)Termination reason: Unknown
% 0.14/0.32 % (26229)Termination phase: Saturation
% 0.14/0.32
% 0.14/0.32 % (26229)Memory used [KB]: 5500
% 0.14/0.32 % (26229)Time elapsed: 0.004 s
% 0.14/0.32 % (26229)Instructions burned: 4 (million)
% 0.14/0.32 % (26231)Instruction limit reached!
% 0.14/0.32 % (26231)------------------------------
% 0.14/0.32 % (26231)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.32 % (26229)------------------------------
% 0.14/0.32 % (26229)------------------------------
% 0.14/0.32 % (26231)Termination reason: Unknown
% 0.14/0.32 % (26231)Termination phase: Saturation
% 0.14/0.32
% 0.14/0.32 % (26231)Memory used [KB]: 1023
% 0.14/0.32 % (26231)Time elapsed: 0.003 s
% 0.14/0.32 % (26231)Instructions burned: 3 (million)
% 0.14/0.32 % (26231)------------------------------
% 0.14/0.32 % (26231)------------------------------
% 0.14/0.32 % (26233)First to succeed.
% 0.14/0.32 % (26228)Also succeeded, but the first one will report.
% 0.14/0.32 % (26234)Also succeeded, but the first one will report.
% 0.14/0.32 % (26233)Refutation found. Thanks to Tanya!
% 0.14/0.32 % SZS status Theorem for theBenchmark
% 0.14/0.32 % SZS output start Proof for theBenchmark
% 0.14/0.32 thf(func_def_0, type, fun_image: ($i > $i) > ($i > $o) > $i > $o).
% 0.14/0.32 thf(func_def_2, type, fun_composition: ($i > $i) > ($i > $i) > $i > $i).
% 0.14/0.32 thf(func_def_3, type, fun_inv_image: ($i > $i) > ($i > $o) > $i > $o).
% 0.14/0.32 thf(func_def_4, type, fun_injective: ($i > $i) > $o).
% 0.14/0.32 thf(func_def_5, type, fun_surjective: ($i > $i) > $o).
% 0.14/0.32 thf(func_def_6, type, fun_bijective: ($i > $i) > $o).
% 0.14/0.32 thf(func_def_7, type, fun_decreasing: ($i > $i) > ($i > $i > $o) > $o).
% 0.14/0.32 thf(func_def_8, type, fun_increasing: ($i > $i) > ($i > $i > $o) > $o).
% 0.14/0.32 thf(func_def_21, type, sK0: $i > $i).
% 0.14/0.32 thf(func_def_22, type, sK1: $i > $i).
% 0.14/0.32 thf(func_def_23, type, sK2: $i > $i).
% 0.14/0.32 thf(func_def_25, type, sK4: $i > $i).
% 0.14/0.32 thf(func_def_26, type, ph5: !>[X0: $tType]:(X0)).
% 0.14/0.32 thf(f53,plain,(
% 0.14/0.32 $false),
% 0.14/0.32 inference(trivial_inequality_removal,[],[f52])).
% 0.14/0.32 thf(f52,plain,(
% 0.14/0.32 ((sK0 @ sK6) != (sK0 @ sK6))),
% 0.14/0.32 inference(superposition,[],[f48,f51])).
% 0.14/0.32 thf(f51,plain,(
% 0.14/0.32 ( ! [X0 : $i] : (((sK0 @ X0) = (sK1 @ X0))) )),
% 0.14/0.32 inference(superposition,[],[f50,f46])).
% 0.14/0.32 thf(f46,plain,(
% 0.14/0.32 ( ! [X1 : $i] : (((sK2 @ (sK4 @ X1)) = X1)) )),
% 0.14/0.32 inference(equality_proxy_clausification,[],[f45])).
% 0.14/0.32 thf(f45,plain,(
% 0.14/0.32 ( ! [X1 : $i] : ((((sK2 @ (sK4 @ X1)) = X1) = $true)) )),
% 0.14/0.32 inference(beta_eta_normalization,[],[f44])).
% 0.14/0.32 thf(f44,plain,(
% 0.14/0.32 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ((sK2 @ Y0) = X1)) @ (sK4 @ X1)))) )),
% 0.14/0.32 inference(sigma_clausification,[],[f43])).
% 0.14/0.32 thf(f43,plain,(
% 0.14/0.32 ( ! [X1 : $i] : (($true = (?? @ $i @ (^[Y0 : $i]: ((sK2 @ Y0) = X1))))) )),
% 0.14/0.32 inference(beta_eta_normalization,[],[f42])).
% 0.14/0.32 thf(f42,plain,(
% 0.14/0.32 ( ! [X1 : $i] : ((((^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((sK2 @ Y1) = Y0)))) @ X1) = $true)) )),
% 0.14/0.32 inference(pi_clausification,[],[f41])).
% 0.14/0.32 thf(f41,plain,(
% 0.14/0.32 ($true = (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((sK2 @ Y1) = Y0))))))),
% 0.14/0.32 inference(beta_eta_normalization,[],[f39])).
% 0.14/0.32 thf(f39,plain,(
% 0.14/0.32 (((^[Y0 : $i > $i]: (!! @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) = Y1)))))) @ sK2) = $true)),
% 0.14/0.32 inference(definition_unfolding,[],[f37,f34])).
% 0.14/0.32 thf(f34,plain,(
% 0.14/0.32 (fun_surjective = (^[Y0 : $i > $i]: (!! @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) = Y1)))))))),
% 0.14/0.32 inference(cnf_transformation,[],[f15])).
% 0.14/0.32 thf(f15,plain,(
% 0.14/0.32 (fun_surjective = (^[Y0 : $i > $i]: (!! @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) = Y1)))))))),
% 0.14/0.32 inference(fool_elimination,[],[f14])).
% 0.14/0.32 thf(f14,plain,(
% 0.14/0.32 ((^[X0 : $i > $i] : (! [X1] : ? [X2] : ((X0 @ X2) = X1))) = fun_surjective)),
% 0.14/0.32 inference(rectify,[],[f5])).
% 0.14/0.32 thf(f5,axiom,(
% 0.14/0.32 ((^[X0 : $i > $i] : (! [X2] : ? [X3] : ((X0 @ X3) = X2))) = fun_surjective)),
% 0.14/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fun_surjective)).
% 0.14/0.32 thf(f37,plain,(
% 0.14/0.32 ((fun_surjective @ sK2) = $true)),
% 0.14/0.32 inference(cnf_transformation,[],[f33])).
% 0.14/0.32 thf(f33,plain,(
% 0.14/0.32 ((fun_surjective @ sK2) = $true) & ((fun_composition @ sK2 @ sK0) = (fun_composition @ sK2 @ sK1)) & (sK1 != sK0)),
% 0.14/0.32 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f31,f32])).
% 0.14/0.32 thf(f32,plain,(
% 0.14/0.32 ? [X0 : $i > $i,X1 : $i > $i,X2 : $i > $i] : (($true = (fun_surjective @ X2)) & ((fun_composition @ X2 @ X1) = (fun_composition @ X2 @ X0)) & (X0 != X1)) => (((fun_surjective @ sK2) = $true) & ((fun_composition @ sK2 @ sK0) = (fun_composition @ sK2 @ sK1)) & (sK1 != sK0))),
% 0.14/0.32 introduced(choice_axiom,[])).
% 0.14/0.32 thf(f31,plain,(
% 0.14/0.32 ? [X0 : $i > $i,X1 : $i > $i,X2 : $i > $i] : (($true = (fun_surjective @ X2)) & ((fun_composition @ X2 @ X1) = (fun_composition @ X2 @ X0)) & (X0 != X1))),
% 0.14/0.32 inference(flattening,[],[f30])).
% 0.14/0.32 thf(f30,plain,(
% 0.14/0.32 ? [X0 : $i > $i,X1 : $i > $i,X2 : $i > $i] : ((X0 != X1) & (((fun_composition @ X2 @ X1) = (fun_composition @ X2 @ X0)) & ($true = (fun_surjective @ X2))))),
% 0.14/0.32 inference(ennf_transformation,[],[f19])).
% 0.14/0.32 thf(f19,plain,(
% 0.14/0.32 ~! [X0 : $i > $i,X1 : $i > $i,X2 : $i > $i] : ((((fun_composition @ X2 @ X1) = (fun_composition @ X2 @ X0)) & ($true = (fun_surjective @ X2))) => (X0 = X1))),
% 0.14/0.32 inference(fool_elimination,[],[f18])).
% 0.14/0.32 thf(f18,plain,(
% 0.14/0.32 ~! [X0 : $i > $i,X1 : $i > $i,X2 : $i > $i] : (((fun_surjective @ X2) & ((fun_composition @ X2 @ X1) = (fun_composition @ X2 @ X0))) => (X0 = X1))),
% 0.14/0.32 inference(rectify,[],[f10])).
% 0.14/0.32 thf(f10,negated_conjecture,(
% 0.14/0.32 ~! [X4 : $i > $i,X7 : $i > $i,X0 : $i > $i] : (((fun_surjective @ X0) & ((fun_composition @ X0 @ X4) = (fun_composition @ X0 @ X7))) => (X4 = X7))),
% 0.14/0.32 inference(negated_conjecture,[],[f9])).
% 0.14/0.32 thf(f9,conjecture,(
% 0.14/0.32 ! [X4 : $i > $i,X7 : $i > $i,X0 : $i > $i] : (((fun_surjective @ X0) & ((fun_composition @ X0 @ X4) = (fun_composition @ X0 @ X7))) => (X4 = X7))),
% 0.14/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm)).
% 0.14/0.32 thf(f50,plain,(
% 0.14/0.32 ( ! [X1 : $i] : (((sK0 @ (sK2 @ X1)) = (sK1 @ (sK2 @ X1)))) )),
% 0.14/0.32 inference(beta_eta_normalization,[],[f49])).
% 0.14/0.32 thf(f49,plain,(
% 0.14/0.32 ( ! [X1 : $i] : ((((^[Y0 : $i]: (sK0 @ (sK2 @ Y0))) @ X1) = ((^[Y0 : $i]: (sK1 @ (sK2 @ Y0))) @ X1))) )),
% 0.14/0.32 inference(argument_congruence,[],[f47])).
% 0.14/0.32 thf(f47,plain,(
% 0.14/0.32 ((^[Y0 : $i]: (sK1 @ (sK2 @ Y0))) = (^[Y0 : $i]: (sK0 @ (sK2 @ Y0))))),
% 0.14/0.32 inference(beta_eta_normalization,[],[f40])).
% 0.14/0.32 thf(f40,plain,(
% 0.14/0.32 (((^[Y0 : $i > $i]: ((^[Y1 : $i > $i]: ((^[Y2 : $i]: (Y1 @ (Y0 @ Y2))))))) @ sK2 @ sK1) = ((^[Y0 : $i > $i]: ((^[Y1 : $i > $i]: ((^[Y2 : $i]: (Y1 @ (Y0 @ Y2))))))) @ sK2 @ sK0))),
% 0.14/0.32 inference(definition_unfolding,[],[f36,f38,f38])).
% 0.14/0.32 thf(f38,plain,(
% 0.14/0.32 (fun_composition = (^[Y0 : $i > $i]: ((^[Y1 : $i > $i]: ((^[Y2 : $i]: (Y1 @ (Y0 @ Y2))))))))),
% 0.14/0.32 inference(cnf_transformation,[],[f23])).
% 0.14/0.32 thf(f23,plain,(
% 0.14/0.32 (fun_composition = (^[Y0 : $i > $i]: ((^[Y1 : $i > $i]: ((^[Y2 : $i]: (Y1 @ (Y0 @ Y2))))))))),
% 0.14/0.32 inference(fool_elimination,[],[f22])).
% 0.14/0.32 thf(f22,plain,(
% 0.14/0.32 (fun_composition = (^[X0 : $i > $i, X1 : $i > $i, X2 : $i] : (X1 @ (X0 @ X2))))),
% 0.14/0.32 inference(rectify,[],[f2])).
% 0.14/0.32 thf(f2,axiom,(
% 0.14/0.32 (fun_composition = (^[X0 : $i > $i, X4 : $i > $i, X3 : $i] : (X4 @ (X0 @ X3))))),
% 0.14/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fun_composition)).
% 0.14/0.32 thf(f36,plain,(
% 0.14/0.32 ((fun_composition @ sK2 @ sK0) = (fun_composition @ sK2 @ sK1))),
% 0.14/0.32 inference(cnf_transformation,[],[f33])).
% 0.14/0.32 thf(f48,plain,(
% 0.14/0.32 ((sK0 @ sK6) != (sK1 @ sK6))),
% 0.14/0.32 inference(negative_extensionality,[],[f35])).
% 0.14/0.32 thf(f35,plain,(
% 0.14/0.32 (sK1 != sK0)),
% 0.14/0.32 inference(cnf_transformation,[],[f33])).
% 0.14/0.32 % SZS output end Proof for theBenchmark
% 0.14/0.32 % (26233)------------------------------
% 0.14/0.32 % (26233)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.32 % (26233)Termination reason: Refutation
% 0.14/0.32
% 0.14/0.32 % (26233)Memory used [KB]: 5500
% 0.14/0.32 % (26233)Time elapsed: 0.005 s
% 0.14/0.32 % (26233)Instructions burned: 4 (million)
% 0.14/0.32 % (26233)------------------------------
% 0.14/0.32 % (26233)------------------------------
% 0.14/0.32 % (26227)Success in time 0.007 s
% 0.14/0.32 % Vampire---4.8 exiting
%------------------------------------------------------------------------------